Compute Node Compute Node

نویسنده

  • David Kotz
چکیده

Many scientiic applications that run on today's multiprocessors, such as weather forecasting and seismic analysis, are bottlenecked by their le-I/O needs. Even if the multiprocessor is conngured with suucient I/O hardware, the le-systemsoftware often fails to provide the available bandwidth to the application. Although libraries and enhanced le-system interfaces can make a signiicant improvement, we believe that fundamental changes are needed in the le-server software. We propose a new technique, disk-directed I/O, to allow the disk servers to determine the ow of data for maximum performance. Our simulations show that tremendous performance gains are possible both for simple reads and writes and for an out-of-core application. Indeed, our disk-directed I/O technique provided consistent high performance that was largely independent of data distribution, and obtained up to 93% of peak disk bandwidth. It was as much as 18 times faster than either a typical parallel le system, or a two-phase-I/O library.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

A New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...

متن کامل

A dual compute resource strategy for computational model-assisted therapeutic interventions

Acquiring and incorporating intraoperative data into image-guided surgical systems has been shown to increase the accuracy of these systems and the accuracy of image-guided surgical procedures. Even with the advent of powerful computers and parallel clusters, the ability to integrate highly resolved computer model information in the planning and execution of image-guided surgery is challenging....

متن کامل

A Development and Deployment Framework for Distributed Branch & Bound

Branch-and-bound intelligently searches the set of feasible solutions to a combinatorial optimization problem: It, in effect, proves that the optimal solution is found without necessarily examining all feasible solutions. The feasible solutions are not given. They can be generated from the problem description. However, doing so usually is computationally infeasible: The number of feasible solut...

متن کامل

CoSimRank: A Flexible & Efficient Graph-Theoretic Similarity Measure

We present CoSimRank, a graph-theoretic similarity measure that is efficient because it can compute a single node similarity without having to compute the similarities of the entire graph. We present equivalent formalizations that show CoSimRank’s close relationship to Personalized PageRank and SimRank and also show how we can take advantage of fast matrix multiplication algorithms to compute C...

متن کامل

Communication versus Computation

The balance of computation and communication in any application or task is, of course, known to be a fundamental determinant of delivered performance. Such balance is a muchsought-after goal for the architects and designers of any system, large or small, from the smallest processor chip to the largest of interconnected hardware or software system (such as the Web). Depending on the workload, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997